COWS: A Timed Service-Oriented Calculus

COWS (Calculus for Orchestration of Web Services) is a foundational language for Service Oriented Computing that combines in an original way a number of ingredients borrowed from well-known process calculi, e.g. asynchronous communication, polyadic synchronization, pattern matching, protection, delimited receiving and killing activities, while resulting different from any of them. In this paper, we extend COWS with timed orchestration constructs, this way we obtain a language capable of completely formalizing the semantics of WS-BPEL, the ‘de facto’ standard language for orchestration of web services. We present the semantics of the extended language and illustrate its peculiarities and expressiveness by means of several examples

A WSDL-Based Type System for WS-BPEL

We tackle the problem of providing rigorous formal foundations to current software engineering technologies for web services. We focus on two of the most used XML-based languages for web services: WSDL and WS-BPEL. To this aim, first we select an expressive subset of WS-BPEL, with special concern for modeling the interactions among web service instances in a network context, and define its operational semantics. We call ws-calculus the resulting formalism. Then, we put forward a rigorous typing discipline that formalizes the relationship existing between ws-calculus terms and the associated WSDL documents and supports verification of their compliance. We prove that the type system and the operational semantics of ws-calculus are ‘sound’ and apply our approach to an example application involving three interacting web services

Using formal methods to develop WS-BPEL applications

In recent years, WS-BPEL has become a de facto standard language for orchestration of Web Services. However, there are still some well-known difficulties that make programming in WS-BPEL a tricky task. In this paper, we firstly point out major loose points of the WS-BPEL specification by means of many examples, some of which are also exploited to test and compare the behaviour of three of the most known freely available WS-BPEL engines. We show that, as a matter of fact, these engines implement different semantics, which undermines portability of WS-BPEL programs over different platforms. Then we introduce Blite, a prototypical orchestration language equipped with a formal operational semantics, which is closely inspired by, but simpler than, WS-BPEL. Indeed, Blite is designed around some of WS-BPEL distinctive features like partner links, process termination, message correlation, long-running business transactions and compensation handlers. Finally, we present BliteC, a software tool supporting a rapid and easy development of WS-BPEL applications via translation of service orchestrations written in Blite into executable WS-BPEL programs. We illustrate our approach by means of a running example borrowed from the official specification of WS-BPEL

Service discovery and negotiation with COWS

To provide formal foundations to current (web) services technologies, we put forward using COWS, a process calculus for specifying, combining and analysing services, as a uniform formalism for modelling all the relevant phases of the life cycle of service-oriented applications, such as publication, discovery, negotiation, deployment and execution. In this paper, we show that constraints and operations on them can be smoothly incorporated in COWS, and propose a disciplined way to model multisets of constraints and to manipulate them through appropriate interaction protocols. Therefore, we demonstrate that also QoS requirement specifications and SLA achievements, and the phases of dynamic service discovery and negotiation can be comfortably modelled in COWS. We illustrate our approach through a scenario for a service-based web hosting provider

Specification and analysis of SOC systems using COWS: a finance case study

Service-oriented computing, an emerging paradigm for distributed computing based on the use of services, is calling for the development of tools and techniques to build safe and trustworthy systems, and to analyse their behaviour. Therefore many researchers have proposed to use process calculi, a cornerstone of current foundational research on specification and analysis of concurrent and distributed systems. We illustrate this approach by focussing on COWS, a process calculus expressly designed for specifying and combining services, while modelling their dynamic behaviour. We present the calculus and one of the analysis techniques it enables, that is based on the temporal logic SocL and the associated model checker CMC. We demonstrate applicability of our tools by means of a large case study, from the financial domain, which is first specified in COWS, and then analysed by using SocL to express many significant properties and CMC to verify them

A model checking approach for verifying COWS specifications

We introduce a logical verification framework for checking functional properties of service-oriented applications formally specified using the service specification language COWS. The properties are described by means of SocL, a logic specifically designed to capture peculiar aspects of services. Service behaviours are abstracted in terms of Doubly Labelled Transition Systems, which are used as the interpretation domain for SocL formulae. We also illustrate the SocL model checker at work on a bank service scenario specified in COWS

A Logical Verification Methodology for Service-Oriented Computing

We introduce a logical verification methodology for checking behavioural properties of service-oriented computing systems. Service properties are described by means of SocL, a branching-time temporal logic that we have specifically designed to express in an effective way distinctive aspects of services, such as, e.g., acceptance of a request, provision of a response, and correlation among service requests and responses. Our approach allows service properties to be expressed in such a way that they can be independent of service domains and specifications. We show an instantiation of our general methodology that uses the formal language COWS to conveniently specify services and the expressly developed software tool CMC to assist the user in the task of verifying SocL formulae over service specifications. We demonstrate feasibility and effectiveness of our methodology by means of the specification and the analysis of a case study in the automotive domain

Neurocognitive Impairment in HIV-Infected Naïve Patients with Advanced Disease: The Role of Virus and Intrathecal Immune Activation

Objective. To investigate intrathecal immune activation parameters and HIV-RNA in HIV-associated neurocognitive disorders (HAND) of advanced naïve HIV-infected patients and to evaluate their dynamics before and after initiation of antiretroviral therapy (ART). Methods. Cross-sectional and longitudinal analysis of HIV RNA, proinflammatory cytokines (IL-6, IL-10, INF-γ, TNF-α, TGF-β1, and TGF-β2) and chemokines (MIP-1α, MIP-1β, and MCP-1) in plasma and cerebrospinal fluid (CSF) of HIV-infected patients with CD4 <200/μL. Results. HAND was diagnosed at baseline in 6/12 patients. Baseline CSF HIV-RNA was comparable in patients with or without HAND, whereas CSF concentration of IL-6 and MIP-1β, proinflammatory cytokines, was increased in HAND patients. CSF evaluation at 12 weeks was available in 10/12 cases. ART greatly reduced HIV-RNA in all patients. Nevertheless, IL-6 and MIP-1β remained elevated after 12 weeks of therapy in HAND patients, in whom CSF HIV RNA decay was slower than the plasmatic one as well. Conclusion. Immune activation, as indicated by inflammatory cytokines, but not higher levels of HIV-RNA is observed in advanced naïve HIV-infected patients with HAND. In HAND patients, ART introduction resulted in a less rapid clearance of CSF viremia compared to plasma and no modifications of intratechal immune activation

Prognostic value of the fibrosis-4 index in human immunodeficiency virus type-1 infected patients initiating antiretroviral therapy with or without hepatitis C virus

Objective: To evaluate the Fibrosis (FIB)-4 index as a predictor of major liver-related events (LRE) and liver-related death (LRD) in human immunodeficiency virus (HIV) type-1 patients initiating combination antiretroviral therapy (cART). Design: Retrospective analysis of a prospective cohort study. Setting: Italian HIV care centers participating to the ICONA Foundation cohort. Participants: Treatment-naive patients enrolled in ICONA were selected who: initiated cART, had hepatitis C virus (HCV) serology results, were HBsAg negative, had an available FIB-4 index at cART start and during follow up. Methods: Cox regression models were used to determine the association of FIB4 with the risk of major LRE (gastrointestinal bleeding, ascites, hepatic encephalopathy, hepato-renal syndrome or hepatocellular carcinoma) or LRD. Results: Three-thousand four-hundred seventy-five patients were enrolled: 73.3% were males, 27.2% HCV seropositive. At baseline (time of cART initiation) their median age was 39 years, had a median CD4+ T cell count of 260 cells/uL, and median HIV RNA 4.9 log copies/mL, 65.9% had a FIB-4 &lt;1.45, 26.4% 1.45–3.25 and 7.7% &gt;3.25. Over a follow up of 18,662 person-years, 41 events were observed: 25 major LRE and 16 LRD (incidence rate, IR, 2.2 per 1,000 PYFU [95% confidence interval, CI 1.6–3.0]). IR was higher in HCV seropositives as compared to negatives (5.9 vs 0.5 per 1,000 PYFU). Higher baseline FIB-4 category as compared to &lt;1.45 (FIB-4 1.45–3.25: HR 3.55, 95% CI 1.09–11.58; FIB-4 &gt;3.25: HR 4.25, 1.21–14.92) and time-updated FIB-4 (FIB-4 1.45–3.25: HR 3.40, 1.02–11.40; FIB-4 &gt;3.25: HR 21.24, 6.75–66.84) were independently predictive of major LRE/LRD, after adjusting for HIV- and HCV-related variables, alcohol consumption and type of cART. Conclusions: The FIB-4 index at cART initiation, and its modification over time are risk factors for major LRE or LRD, independently of infection with HCV and could be used to monitor patients on cART